![]() ![]() |
| The following review questions were covered in Labs 02
and 03 and are questions taken from the course website. NOT ALL questions
from the course website were discussed in lab. Please note that the information presented here does not necessarily represent a complete answer to the review question. The information is intended to spark student's memory for those who attended lab OR provide a base (hint) from where to start for those students who did not attend lab. | |||
First Fit. Since all records are of fixed length, the first available entry in the free-list will be large enough to fit a new record. |
|||
Compaction will eliminate external fragmentation and will not affect internal fragmentation. |
|||
Time Complexity. A comparison of sorting algorithms will normally consider both the number of data swaps and the number of comparisons required. |
|||
unique, canonical, dataless, unmodifiable |
|||
ADDING A RECORD - add to the end of the file, update the index DELETING A RECORD - delete the record, move the last record to the deleted records location, update the index file |
|||
CASE 1 - fixed length field, this makes managing and maintaining the record file uncomplicated but wastes a lot of space CASE 2 - varying length field, this uses space efficiently but makes managing and maintaining the record file somewhat more complicated CASE 3 - a combination (fixed length field that points to a space in memory where the data is kept), this tries to capitalize on the advantages of both approaches listed above but does imply the creation of a new 'file/memory space' to store the varying length data |
|||
![]() |
| © Copyright 2002 |
| Questions? Please Email: gwen@cpsc.ucalgary.ca |
| Last modified October 7, 2002 |